Wiretap Channels With Causal and Non-Causal State Information: Revisited

The coding problem for wiretap channels (WTCs) with causal and/or non-causal channel state information (CSI) available at the encoder (Alice) decoder (Bob) is studied, particularly focusing on achievable secret-message secret-key (SM-SK) rate pairs under semantic security criterion. One of our main results summarized as Theorem 3 inner bounds SM-SK pairs, which follows immediately by leveraging unified seminal theorem WTCs CSI Alice that has been recently established Bunin et al.. only thing to do here just re-interpret latter scheme in a manner restricting range auxiliary random variables appearing encoding subclass encoder. This technique referred “plugging.” Then, we are able dispense block-Markov used previous works Chia and El Gamal, Fujita, Han Sasaki then extend all known rates. other include exact capacity region “both” Bob (Theorem 2), “tighter” outer bound state-reproducing schemes (Proposition 4), degraded causal/non-causal both 4).